Full Abstraction and Expressive Completenes for FP
نویسندگان
چکیده
We consider issues related to the expressive power of the programming language FP. In particular, we consider whether a number of variants of FP are fully abstract and expressively complete. For example, we show that a version of FP with only one-sided sequences behave similarly to PCF in that the addition of parallel or is suucient to make it fully abstract. However, the addition of parallel or to FP (with its two-sided innnite sequences) is not suucient to achieve full abstraction. By considering these and other variants, we obtain a better understanding of what is required of a language and semantics in order to guarantee full abstraction and expressive completeness.
منابع مشابه
Compensatory expressive behavior for facial paralysis: adaptation to congenital or acquired disability.
OBJECTIVE Although there has been little research on the adaptive behavior of people with congenital compared to acquired disability, there is reason to predict that people with congenital conditions may be better adapted because they have lived with their conditions for their entire lives (Smart, 2008). We examined whether people with congenital facial paralysis (FP), compared to people with a...
متن کاملFull Reduction in the Face of Absurdity
Core calculi that model the essence of computations use full reduction semantics to be built on solid grounds. Expressive type systems for these calculi may use propositions to refine the notion of types, which allows abstraction over possibly inconsistent hypotheses. To preserve type soundness, reduction must then be delayed until logical hypotheses on which the computation depends have been p...
متن کاملFunctional Programming - Crossing The Chasm?
Once again the computing community is coming to appreciate the expressive power of functional programming (FP) [1, 2]. Technical gatherings are buzzing with talk and, of course, debates about Haskell, Lisp/Scheme, Erlang and their younger hybrid cousins O’Caml, Scala, F# and Clojure. At the same time, popular OO languages Java and C# are being extended to support functional constructs with even...
متن کاملمحاسبه خواص ساختاری و الکترونی نیمرسانای منیزیم سلنید(MgSe) با استفاده از امواج تخت تقویت شده خطی با پتانسیل کامل( FP-LAPW)
In this paper, electronic structure, energy band structure and electronic density in cubic phase for semi-conductor MgSe are studied using WIEN2k package. This employs the Full Potential-Linearized augmented Plane Wave (FP-LAPW) method in the framework of Density Functional Theory (DFT) with generalize different approximations. The results showed a band gap of 2.4 eV at Γ point in the Birrouin ...
متن کاملObservational Equivalence and Full Abstraction in the Symmetric Interaction Combinators
The symmetric interaction combinators are an equally expressive variant of Lafont’s interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them, analogous to normal form and head normal form equivalence in the lambda-calculus. Then, we prove a full abstraction result for each of the two equivalences. This is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1987